Enhancing the Scale-Free Network's Attack Tolerance

نویسندگان

  • Zehui Qu
  • Pu Wang
  • Zhiguang Qin
چکیده

Despite the large size of most communication systems such as the Internet and World Wide Web (WWW), there is a relatively short path between two nodes, revealing the networks’ small world characteristic which speeds the delivery of information and data. While these networks have a surprising error tolerance, their scale-free topology makes them fragile under intentional attack, leaving us a challenge on how to improve the networks’ robustness against attack without losing their small world merit. Here we try to enhance scale-free network’s tolerance under attack by using a method based on networks’ topology re-constructing.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhancing the robustness of scale-free networks

Error tolerance and attack vulnerability are two common and important properties of complex networks, which are usually used to evaluate the robustness of a network. Recently, much work has been devoted to determining the network design with optimal robustness. However, little attention has been paid to the problem of how to improve the robustness of existing networks. In this paper, we present...

متن کامل

Comparative Resilience Notions and Vertex Attack Tolerance of Scale-Free Networks

We are concerned with an appropriate mathematical measure of resilience in the face of targeted node attacks for arbitrary degree networks, and subsequently comparing the resilience of different scale-free network models with the proposed measure. We strongly motivate our resilience measure termed vertex attack tolerance (VAT), which is denoted mathematically as τ(G) = minS⊂V |S| |V−S−Cmax(V−S)...

متن کامل

Efficiency of Scale-Free Networks: Error and Attack Tolerance

The concept of network efficiency, recently proposed to characterize the properties of small-world networks, is here used to study the effects of errors and attacks on scale-free networks. Two different kinds of scale-free networks, i.e. networks with power law P(k), are considered: 1) scale-free networks with no local clustering produced by the Barabasi-Albert model and 2) scale-free networks ...

متن کامل

Evolution of cooperation on scale-free networks subject to error and attack

We study the evolution of cooperation in the prisoner’s dilemma and the snowdrift game on scale-free networks that are subjected to intentional and random removal of vertices. We show that, irrespective of the game type, cooperation on scale-free networks is extremely robust against random deletion of vertices, but declines quickly if vertices with the maximal degree are targeted. In particular...

متن کامل

Stability and topology of scale-free networks under attack and defense strategies.

We study tolerance and topology of random scale-free networks under attack and defense strategies that depend on the degree k of the nodes. This situation occurs, for example, when the robustness of a node depends on its degree or in an intentional attack with insufficient knowledge of the network. We determine, for all strategies, the critical fraction p(c) of nodes that must be removed for di...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009